Sphere-covering, measure concentration, and source coding
نویسندگان
چکیده
منابع مشابه
Sphere-covering, measure concentration, and source coding
Suppose A is a finite set, let P be a discrete distribution on A, and let M be an arbitrary “mass” function on A. We give a precise characterization of the most efficient way in which An can be almost-covered using spheres of a fixed radius. An almost-covering is a subset Cn of An, such that the union of the spheres centered at the points of Cn has probability close to one with respect to the p...
متن کاملEfficient Sphere-Covering and Converse Measure Concentration Via Generalized Source Coding Theorems
Suppose A is a finite set, let P be a discrete probability distribution on A, and let M be an arbitrary “mass” function on A. We give a precise characterization of the most efficient way in which An can be almost-covered using spheres of a fixed radius. An almost-covering is a subset Cn of A n, such that the union of the spheres centered at the points of Cn has probability close to one with res...
متن کاملEfficient sphere-covering and converse measure concentration via generalized coding theorems
Suppose A is a finite set equipped with a probability measure P and let M be a “mass” function on A. We give a probabilistic characterization of the most efficient way in which An can be almost-covered using spheres of a fixed radius. An almost-covering is a subset Cn of A n, such that the union of the spheres centered at the points of Cn has probability close to one with respect to the product...
متن کاملConcentration of Measure Inequalities in Information Theory, Communications, and Coding Concentration of Measure Inequalities in Information Theory, Communications, and Coding
During the last two decades, concentration inequalities have been the subject of exciting developments in various areas, including convex geometry, functional analysis, statistical physics, high-dimensional statistics, pure and applied probability theory (e.g., concentration of measure phenomena in random graphs, random matrices, and percolation), information theory, theoretical computer scienc...
متن کاملA randomized covering-packing duality between source and channel coding
Given a general channel b over which the uniform X source, denoted by U , is directly communicated within distortion D. The source U puts uniform distribution on all sequences with type precisely pX as compared with the i.i.d. X source which puts ‘most of’ its mass on sequences with type ‘close to’ pX . A randomized covering-packing duality is established between source-coding and channel-codin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2001
ISSN: 0018-9448
DOI: 10.1109/18.923735